Evolving ant colony optimization based unit commitment

نویسندگان

  • K. Vaisakh
  • L. R. Srinivas
چکیده

Ant colony optimization (ACO) was inspired by the observation of natural behavior of real ants’ pheromone trail formation and foraging. Ant colony optimization ismore suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem. Multistage decision making of ACO gives an edge over other conventional methods. This paper proposes evolving ant colony optimization (EACO) method for solving unit commitment (UC) problem. The EACO employs genetic algorithm (GA) for finding optimal set of ACO parameters, while ACO solves the UC problem. Problem formulation takes into consideration the minimum up and down time constraints, startup cost, spinning reserve, and generation limit constraints. The feasibility of the proposed approach is demonstrated on two different systems. The test results are encouraging and compared with those obtained by other methods. © 2010 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unit Commitment by Evolving Ant Colony Optimization

Ant Colony Optimization is more suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem, and multistage decision making of ACO has an edge over other conventional methods. In this paper, the authors propose the Evolving Ant Colony Optimization (EACO) method for solving unit commitment (UC) problem. The EACO employs Genetic Algorithm (GA) f...

متن کامل

Discrete genetic algorithm and real ant colony optimization for the unit commitment problem

In this paper, a cooperative metaheuristic for the solution of the Unit Commitment problem is presented. This problem is known to be a large scale, mixed integer problem. Due to combinatorial complexity, the exact solution is often intractable. Thus, a metaheuristic based method has to be used to compute a near optimal solution with low computation times. A new approach is presented here. The m...

متن کامل

Profit based unit commitment for GENCOs using parallel NACO in a distributed cluster

Deregulation process has created an intense competition with the participation of many generating companies (GENCOs) in a power market. Wholesale transactions (bids and offer) have to be cleared and settled in a shorter duration. Therefore, this necessitates for the system operator to quick and smarter decisions. In this problem formulation, profit based unit commitment (PBUC) problem aims in m...

متن کامل

Detailed Literature Survey on Different Methodologies of Unit Commitment

This Paper explores the existing methodologies for the solution of unit commitment problem of large size power system. The survey covers exhaustive review of literature available over the past five decades published by the Pioneers, Experts & Researchers working in this field. It includes publications in standard international journals like IEEE, IEE, ELSEVIER etc, and proceedings of prominent ...

متن کامل

Self-evolving Ant Colony Optimization and Its Application to Traveling Salesman Problem

Ant colony optimization (ACO) algorithms are a recently developed, population-based approach which has been successfully applied to combinatorial optimization problems. However, in the ACO algorithms, it is difficult to adjust the balance between intensification and diversification and thus the performance is not always very well. In this paper we proposed an improved ACO algorithm in which a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Appl. Soft Comput.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2011